A multiplicative analogue of Schnirelmann's theorem
نویسندگان
چکیده
منابع مشابه
A multiplicative Banach-Stone theorem
The Banach-Stone theorem states that any surjective, linear mapping T between spaces of continuous functions that satisfies ‖T (f)− T (g)‖ = ‖f − g‖, where ‖ · ‖ denotes the uniform norm, is a weighted composition operator. We study a multiplicative analogue, and demonstrate that a surjective mapping T , not necessarily linear, between algebras of continuous functions with ‖T (f)T (g)‖ = ‖fg‖ m...
متن کاملOseledec’s Multiplicative Ergodic Theorem
These are notes for a talk in the Junior Geometry seminar at UT Austin on Oseledec’s multiplicative ergodic theorem given in Fall 2002. The purpose of the notes is to insure that I know, or at least am convinced that I think I know, what I am talking about. They contain far more material than the talks themselves, constituting a complete proof of the discrete-time version of the multiplicative ...
متن کاملA Fractional Analogue of Brooks' Theorem
Let ∆(G) be the maximum degree of a graph G. Brooks’ theorem states that the only connected graphs with chromatic number χ(G) = ∆(G) + 1 are complete graphs and odd cycles. We prove a fractional analogue of Brooks’ theorem in this paper. Namely, we classify all connected graphs G such that the fractional chromatic number χf (G) is at least ∆(G). These graphs are complete graphs, odd cycles, C 2...
متن کاملA Bipartite Analogue of Dilworth's Theorem
Let m(n) be the maximum integer such that every partially ordered set P with n elements contains two disjoint subsets A and B, each with cardinality m(n), such that either every element of A is greater than every element of B or every element of A is incomparable with every element of B. We prove that m(n) = Θ( n logn). Moreover, for fixed ǫ ∈ (0, 1) and n sufficiently large, we construct a par...
متن کاملA Complex Analogue of Toda’s Theorem
Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result, which illustrates the power of counting is considered to be a seminal result in computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the London Mathematical Society
سال: 2016
ISSN: 0024-6093,1469-2120
DOI: 10.1112/blms/bdw062